منابع مشابه
turkish-israeli relations and their implication on iranian national security
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
15 صفحه اولNP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes
In this paper, we discuss the adjacency structures of some classes of 0-1 polytopes including knapsack polytopes, set covering polytopes and 0-1 polytopes represented by complete sets of implicants. We show that for each class of 0-1 polytope, non-adjacency test problems are NP-complete. For equality constrained knapsack polytopes, we can solve adjacency test problems in pseudo polynomial time.
متن کاملMonotone paths on polytopes
We investigate the vertex-connectivity of the graph of f -monotone paths on a d-polytope P with respect to a generic functional f . The third author has conjectured that this graph is always (d − 1)-connected. We resolve this conjecture positively for simple polytopes and show that the graph is 2-connected for any d-polytope with d ≥ 3. However, we disprove the conjecture in general by exhibiti...
متن کاملOn Some Polytopes
In this paper, we consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of infeasible 0,1 vectors that guarantee that P has a small Chvátal rank. Our conditions are in terms of the subgraph induced by these infeasible 0,1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvátal...
متن کاملNon-Flat Regular Polytopes and Restrictions on Chiral Polytopes
An abstract polytope is flat if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat regular polytopes in each rank, and use this to show that for n > 8, a chiral n-polytope has at least 48(n− 2)(n− 2)! flags.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1987
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187891